<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers: vEBTree&lt; T &gt;::FilterIterator Class Reference</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Class&#160;List</span></a></li>
      <li><a href="classes.html"><span>Class&#160;Index</span></a></li>
      <li><a href="inherits.html"><span>Class&#160;Hierarchy</span></a></li>
      <li><a href="functions.html"><span>Class&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="classvEBTree.html">vEBTree</a></li><li class="navelem"><a class="el" href="classvEBTree_1_1FilterIterator.html">FilterIterator</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-methods">Protected Member Functions</a> &#124;
<a href="#pro-attribs">Protected Attributes</a> &#124;
<a href="#friends">Friends</a>  </div>
  <div class="headertitle">
<div class="title">vEBTree&lt; T &gt;::FilterIterator Class Reference</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="vEBTree_8h_source.html">vEBTree.h</a>&gt;</code></p>

<p><a href="classvEBTree_1_1FilterIterator-members.html">List of all members.</a></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:ad3e89fdbb90bee34d60a322fdf6eac30"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#ad3e89fdbb90bee34d60a322fdf6eac30">~FilterIterator</a> ()</td></tr>
<tr class="memdesc:ad3e89fdbb90bee34d60a322fdf6eac30"><td class="mdescLeft">&#160;</td><td class="mdescRight">The destructor.  <a href="#ad3e89fdbb90bee34d60a322fdf6eac30"></a><br/></td></tr>
<tr class="memitem:ae9b7eeeb2eb5569448b2f877604ec1ec"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#ae9b7eeeb2eb5569448b2f877604ec1ec">start</a> ()</td></tr>
<tr class="memdesc:ae9b7eeeb2eb5569448b2f877604ec1ec"><td class="mdescLeft">&#160;</td><td class="mdescRight">Start enumeration.  <a href="#ae9b7eeeb2eb5569448b2f877604ec1ec"></a><br/></td></tr>
<tr class="memitem:a1d94b3c0371ada541db5d2c88427b415"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a1d94b3c0371ada541db5d2c88427b415">restart</a> ()</td></tr>
<tr class="memdesc:a1d94b3c0371ada541db5d2c88427b415"><td class="mdescLeft">&#160;</td><td class="mdescRight">Restart enumeration.  <a href="#a1d94b3c0371ada541db5d2c88427b415"></a><br/></td></tr>
<tr class="memitem:a4b629ee48b4d1781202504ded1b18239"><td class="memItemLeft" align="right" valign="top">virtual void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a4b629ee48b4d1781202504ded1b18239">restartFrom</a> (long i)</td></tr>
<tr class="memdesc:a4b629ee48b4d1781202504ded1b18239"><td class="mdescLeft">&#160;</td><td class="mdescRight">Restart enumeration from a specified element.  <a href="#a4b629ee48b4d1781202504ded1b18239"></a><br/></td></tr>
<tr class="memitem:a249372c0ac4c5ed22fa6c4edf725179f"><td class="memItemLeft" align="right" valign="top">virtual bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a249372c0ac4c5ed22fa6c4edf725179f">hasNext</a> ()</td></tr>
<tr class="memdesc:a249372c0ac4c5ed22fa6c4edf725179f"><td class="mdescLeft">&#160;</td><td class="mdescRight">Determine if still there is a element in the set and in the filter not enumerated yet.  <a href="#a249372c0ac4c5ed22fa6c4edf725179f"></a><br/></td></tr>
<tr class="memitem:a0eafee3aedf12f98a4a12bf6db2f6e1e"><td class="memItemLeft" align="right" valign="top">virtual long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a0eafee3aedf12f98a4a12bf6db2f6e1e">next</a> ()</td></tr>
<tr class="memdesc:a0eafee3aedf12f98a4a12bf6db2f6e1e"><td class="mdescLeft">&#160;</td><td class="mdescRight">Index of the next element in the set according to the current enumeration.  <a href="#a0eafee3aedf12f98a4a12bf6db2f6e1e"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pro-methods"></a>
Protected Member Functions</h2></td></tr>
<tr class="memitem:a40bcf0301039d074cc27afdc67cd96b9"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a40bcf0301039d074cc27afdc67cd96b9">FilterIterator</a> (<a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt; *<a class="el" href="classvEBTree_1_1FilterIterator.html#a29a34ab661bb46e995904a117519c3ce">t</a>, OrderedSet&lt; long &gt; *<a class="el" href="classvEBTree_1_1FilterIterator.html#a459143e4234e64478fa0f0235c98ddea">filter</a>)</td></tr>
<tr class="memdesc:a40bcf0301039d074cc27afdc67cd96b9"><td class="mdescLeft">&#160;</td><td class="mdescRight">A constructor for a <a class="el" href="classvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a> over a specified <a class="el" href="classvEBTree.html" title="A OrderedSet implement as a static van Emde Boas tree to store a set of elements from a fixed univers...">vEBTree</a>.  <a href="#a40bcf0301039d074cc27afdc67cd96b9"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a29a34ab661bb46e995904a117519c3ce"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a29a34ab661bb46e995904a117519c3ce">t</a></td></tr>
<tr class="memdesc:a29a34ab661bb46e995904a117519c3ce"><td class="mdescLeft">&#160;</td><td class="mdescRight">the enclosing vEBTree&lt;T&gt;, which gives access to <a class="el" href="classvEBTree.html#a351f1100d69f7fd48d6dc906c5c8c46b" title="The node in the index i of the leaf level of the tree.">vEBTree&lt;T&gt;::treeNode</a> method.  <a href="#a29a34ab661bb46e995904a117519c3ce"></a><br/></td></tr>
<tr class="memitem:a459143e4234e64478fa0f0235c98ddea"><td class="memItemLeft" align="right" valign="top">OrderedSet&lt; long &gt; *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a459143e4234e64478fa0f0235c98ddea">filter</a></td></tr>
<tr class="memdesc:a459143e4234e64478fa0f0235c98ddea"><td class="mdescLeft">&#160;</td><td class="mdescRight">the filter to enumeration  <a href="#a459143e4234e64478fa0f0235c98ddea"></a><br/></td></tr>
<tr class="memitem:ad69c4ef0ce44269d24f259342ca26dfa"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#ad69c4ef0ce44269d24f259342ca26dfa">current</a></td></tr>
<tr class="memitem:a6fac30edd95363d80e93013fdd41fdba"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a6fac30edd95363d80e93013fdd41fdba">idx</a></td></tr>
<tr class="memdesc:a6fac30edd95363d80e93013fdd41fdba"><td class="mdescLeft">&#160;</td><td class="mdescRight">index of the current node in the last level.  <a href="#a6fac30edd95363d80e93013fdd41fdba"></a><br/></td></tr>
<tr class="memitem:a26483e542ec476cced04117cf172853d"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a26483e542ec476cced04117cf172853d">word_size</a></td></tr>
<tr class="memdesc:a26483e542ec476cced04117cf172853d"><td class="mdescLeft">&#160;</td><td class="mdescRight">the size in bits of a word  <a href="#a26483e542ec476cced04117cf172853d"></a><br/></td></tr>
<tr class="memitem:acff6130654138ed24aa885e9f309d430"><td class="memItemLeft" align="right" valign="top">long&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#acff6130654138ed24aa885e9f309d430">size</a></td></tr>
<tr class="memdesc:acff6130654138ed24aa885e9f309d430"><td class="mdescLeft">&#160;</td><td class="mdescRight">the size of the <a class="el" href="classvEBTree.html" title="A OrderedSet implement as a static van Emde Boas tree to store a set of elements from a fixed univers...">vEBTree</a> that is being enumerate, its a simple copy of the value t-&gt;<a class="el" href="classvEBTree_1_1FilterIterator.html#acff6130654138ed24aa885e9f309d430" title="the size of the vEBTree that is being enumerate, its a simple copy of the value t-&gt;size().">size()</a>.  <a href="#acff6130654138ed24aa885e9f309d430"></a><br/></td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2><a name="friends"></a>
Friends</h2></td></tr>
<tr class="memitem:a8219f22e091c9743e43e210940a8490d"><td class="memItemLeft" align="right" valign="top">class&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classvEBTree_1_1FilterIterator.html#a8219f22e091c9743e43e210940a8490d">vEBTree</a></td></tr>
</table>
<hr/><h2>Constructor &amp; Destructor Documentation</h2>
<a class="anchor" id="a40bcf0301039d074cc27afdc67cd96b9"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::FilterIterator </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt; *&#160;</td>
          <td class="paramname"><em>t</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">OrderedSet&lt; long &gt; *&#160;</td>
          <td class="paramname"><em>filter</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>A constructor for a <a class="el" href="classvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a> over a specified <a class="el" href="classvEBTree.html" title="A OrderedSet implement as a static van Emde Boas tree to store a set of elements from a fixed univers...">vEBTree</a>. </p>
<p>Create a <a class="el" href="classvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a> to look up a specified <a class="el" href="classvEBTree.html" title="A OrderedSet implement as a static van Emde Boas tree to store a set of elements from a fixed univers...">vEBTree</a>. The <a class="el" href="classvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a> enumerate all the elements in the set represented by the object passed as parameter.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">t</td><td>the specified tree.</td></tr>
    <tr><td class="paramname">filter</td><td>the filter to the correspondent enumeration </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="ad3e89fdbb90bee34d60a322fdf6eac30"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::~FilterIterator </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>The destructor. </p>

</div>
</div>
<hr/><h2>Member Function Documentation</h2>
<a class="anchor" id="a249372c0ac4c5ed22fa6c4edf725179f"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::hasNext </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Determine if still there is a element in the set and in the filter not enumerated yet. </p>
<p>This method determine if there is a element in the set and in the filter not enumerate yet. It look in all the leaf level of the tree using the information of the other levels.</p>
<p>We start the search in the word of the least enumerated element. If it has other bit 1 we return this value. If not we look in the upper level for the next non null word and so go on untill the top level where we make a serial search.</p>
<dl class="section return"><dt>Returns:</dt><dd>true if there is a element not enumerated yet that belongs to the set and the filter , and false otherwise. </dd></dl>

</div>
</div>
<a class="anchor" id="a0eafee3aedf12f98a4a12bf6db2f6e1e"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::next </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Index of the next element in the set according to the current enumeration. </p>
<p>The next element in the current enumeration. The order is the natural order between the natural numbers.</p>
<dl class="section return"><dt>Returns:</dt><dd>the next element, if exists one; otherwise, a value greater or equal to the size of the universe. </dd></dl>

</div>
</div>
<a class="anchor" id="a1d94b3c0371ada541db5d2c88427b415"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::restart </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Restart enumeration. </p>
<p>Restart the enumeration. It will lost all the current state and it will start over the enumeration.</p>
<p>Usually it is a simple call to <a class="el" href="classvEBTree_1_1FilterIterator.html#ae9b7eeeb2eb5569448b2f877604ec1ec" title="Start enumeration.">start()</a>.</p>
<dl class="section see"><dt>See also:</dt><dd><a class="el" href="classvEBTree_1_1FilterIterator.html#ae9b7eeeb2eb5569448b2f877604ec1ec" title="Start enumeration.">start()</a> </dd></dl>

</div>
</div>
<a class="anchor" id="a4b629ee48b4d1781202504ded1b18239"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::restartFrom </td>
          <td>(</td>
          <td class="paramtype">long&#160;</td>
          <td class="paramname"><em>i</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Restart enumeration from a specified element. </p>
<p>Restart the enumeration. it will lost all the current state and it will start over from the smalest element in the set that is bigger or equal than the specified element.</p>
<p>If the specified element is not a element of the universe a error will occur.</p>
<dl class="params"><dt>Parameters:</dt><dd>
  <table class="params">
    <tr><td class="paramname">the</td><td>specified element </td></tr>
  </table>
  </dd>
</dl>

</div>
</div>
<a class="anchor" id="ae9b7eeeb2eb5569448b2f877604ec1ec"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T &gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::start </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Start enumeration. </p>
<p>Initailize all the variables and start a enumeration of the elements in the set.</p>
<p>The variables idx and slide are set to zero and the initial word is set to be the first non null word. </p>

</div>
</div>
<hr/><h2>Friends And Related Function Documentation</h2>
<a class="anchor" id="a8219f22e091c9743e43e210940a8490d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">friend class <a class="el" href="classvEBTree.html">vEBTree</a></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">friend</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<hr/><h2>Member Data Documentation</h2>
<a class="anchor" id="ad69c4ef0ce44269d24f259342ca26dfa"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::current</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

</div>
</div>
<a class="anchor" id="a459143e4234e64478fa0f0235c98ddea"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">OrderedSet&lt;long&gt;* <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::filter</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the filter to enumeration </p>

</div>
</div>
<a class="anchor" id="a6fac30edd95363d80e93013fdd41fdba"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::idx</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>index of the current node in the last level. </p>

</div>
</div>
<a class="anchor" id="acff6130654138ed24aa885e9f309d430"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::size</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the size of the <a class="el" href="classvEBTree.html" title="A OrderedSet implement as a static van Emde Boas tree to store a set of elements from a fixed univers...">vEBTree</a> that is being enumerate, its a simple copy of the value t-&gt;<a class="el" href="classvEBTree_1_1FilterIterator.html#acff6130654138ed24aa885e9f309d430" title="the size of the vEBTree that is being enumerate, its a simple copy of the value t-&gt;size().">size()</a>. </p>

</div>
</div>
<a class="anchor" id="a29a34ab661bb46e995904a117519c3ce"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classvEBTree.html">vEBTree</a>&lt;T&gt;* <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::t</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the enclosing vEBTree&lt;T&gt;, which gives access to <a class="el" href="classvEBTree.html#a351f1100d69f7fd48d6dc906c5c8c46b" title="The node in the index i of the leaf level of the tree.">vEBTree&lt;T&gt;::treeNode</a> method. </p>

</div>
</div>
<a class="anchor" id="a26483e542ec476cced04117cf172853d"></a>
<div class="memitem">
<div class="memproto">
<div class="memtemplate">
template&lt;typename T&gt; </div>
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">long <a class="el" href="classvEBTree.html">vEBTree</a>&lt; T &gt;::FilterIterator::word_size</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>the size in bits of a word </p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>datastruct/<a class="el" href="vEBTree_8h_source.html">vEBTree.h</a></li>
</ul>
</div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Tue Nov 6 2012 19:09:46 for Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
